FDBG, the CLPFD Debugger Library of SICStus Prolog
نویسندگان
چکیده
FDBG (short for Finite domain DeBuGger) is a tool addressing the problems of debugging nite domain (FD) constraint programs. Implemented as a SICStus Prolog library, it allows CLP(FD) programmers to trace FD variable domain changes. FDBG is capable of detecting the wake-up of constraints as well as the steps of labeling, and it reports the e ects of these events on the variables. The simplest way to use FDBG is to produce a wallpaper trace of the run of the constraint program. The trace is analyzed (typically post-mortem) either manually or by a tool designed for this purpose. However, program behavior may also be observed in real time exploiting the modular design and the exible output redirecting capabilities. FDBG was written almost entirely in Prolog as user space code, no native routines were used directly. It is also included (with source) in the o cial SICStus distribution in versions 3.9 and upwards.
منابع مشابه
Towards A Configuration Specification Language Based On Constraints Logic Programming
In this paper, we concentrate on describing a configuration specification language suitable for most of configuration problems. The language and the generated configuration task code are based on the key-component approach. The implementation of the language is based on the CLPFD library of SICStus Prolog. The language consists of a number of Prolog clauses, which are compiled into CLPFD constr...
متن کاملNative Code Compilation in SICStus Prolog
SICStus Prolog is a sequential Prolog implementation built around a version of the Warren Abstract Machine (WAM). For several years, SICStus has supported WAM-to-native code compilation for Sun workstations. This old scheme is neither as portable nor as open to experiments as would be desirable. With the support of my colleagues in the SICStus group, I have developed a new scheme that is more o...
متن کاملLibrary PCC(FD) documentation
This documentation describes the PCC(FD) library v.0. that can be downloaded from http://www.irisa.fr/lande/petit/index.en.html. The library has been built upon SICStus 3.11.0 [2].
متن کاملThe Finite Domain Constraint Solver of SWI-Prolog
We present a new constraint solver over finite domains, freely available as library(clpfd) in SWI-Prolog. Our solver has several unique features, which we describe in this paper: Reasoning over arbitrarily large integers, always terminating propagation, and a domain-specific language that concisely expresses the full semantics of constraint reification. The library is entirely written in Prolog...
متن کاملThe Boolean Constraint Solver of SWI-Prolog (System Description)
We present a new constraint solver over Boolean variables, available as library(clpb) in SWI-Prolog. Our solver distinguishes itself from other available CLP(B) solvers by several unique features: First, it is written entirely in Prolog and is hence portable to different Prolog implementations. Second, it is the first freely available BDDbased CLP(B) solver. Third, we show that new interface pr...
متن کامل